Strong Circuit Double Cover of Some Cubic Graphs
نویسندگان
چکیده
Let C be a given circuit of a bridgeless cubic graph G. It was conjectured by Seymour that G has a circuit double cover (CDC) containing the given circuit C. This conjecture (strong CDC [SCDC] conjecture) has been verified by Fleischner and Häggkvist for various families of graphs and circuits. In this article, some of these earlier results have been improved: Contract grant sponsor: NSF-China; contract grant number: 11171288 (to Z.M.); contract grant sponsor: NSA; contract grant number: H98230-12-1-0233 (to C.-Q.Z.); contract grant sponsor: NSF; contract grant number: DMS-1264800 (to C.-Q.Z.). Journal of Graph Theory C © 2014 Wiley Periodicals, Inc. 131 132 JOURNAL OF GRAPH THEORY (1) if H = G −C contains a Hamilton path or a Y -tree of order less than 14, then G has a CDC containing C; (2) if H = G −C is connected and |V (H )| ≤ 6, then G has a CDC containing C. C © 2014 Wiley Periodicals, Inc. J. Graph Theory 78: 131–142, 2015
منابع مشابه
On semiextensions and circuit double covers
We introduce a concept of a semiextension of a cycle, and we conjecture a simple necessary and sufficient condition for its existence. It is shown that our conjecture implies a strong form of the circuit double cover conjecture. We prove that the conjecture is equivalent to its restriction to cubic graphs, and we show that it holds for every cycle which is a spanning subgraph of the given graph...
متن کاملOrientable embeddings and orientable cycle double covers of projective-planar graphs
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected proje...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملKotzig frames and circuit double covers
A cubic graph H is called a Kotzig graph if H has a circuit double cover consisting of three Hamilton circuits. It was first proved by Goddyn that if a cubic graph G contains a spanning subgraph H which is a subdivision of a Kotzig graph then G has a circuit double cover. A spanning subgraph H of a cubic graph G is called a Kotzig frame if the contracted graph G/H is even and every non-circuit ...
متن کاملEven cycle decompositions of 4-regular graphs and line graphs
An even cycle decomposition of a graph is a partition of its edge into even cycles. We first give some results on the existence of even cycle decomposition in general 4-regular graphs, showing that K5 is not the only graph in this class without such a decomposition. Motivated by connections to the cycle double cover conjecture we go on to consider even cycle decompositions of line graphs of 2-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 78 شماره
صفحات -
تاریخ انتشار 2015